A Token Based k-Resilient Mutual Exclusion Algorithm for Distributed Systems
نویسندگان
چکیده
This paper presents a token based mutual exclusion algorithm which is k-resilient in that it can tolerate upto k site/link failures. The algorithm uses many features of the token based algorithm by Raymond 5] and inherits many of its advantages , viz. simplicity of the token message and the local data structure at each site. Correctness proofs of the algorithm and complexity analysis are included.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملComparative Study of Mutual Exclusion Algorithms in Distributed Systems
Mutual Exclusion is an important phenomenon in distributed systems. In this paper, we analyze and compare various mutual exclusion algorithms in distributed systems. In permission based mutual exclusion process waits for permission from other processes to enter into a critical section. In token based mutual exclusion, a special message called token is passed over the system and process holding ...
متن کاملA New Approach to Mutual Exclusion for Tackling Selfish Nodes in a Distributed Spectrum
In distributed systems, it is difficult to predict whether the node is genuine or not and this may lead to the addition of selfish/ malicious nodes. The selfish/malicious nodes are the nodes that continue the execution of their codes for unknown/prolonged duration. For allotting the nodes with resources, the mutual exclusion algorithms, either token based, non-token based quorum-based or agreem...
متن کاملA New Token Passing Distributed Mutual Exclusion Algorithm
Eliminating interference between concurrently executing activities through mutual exclusion is one of the most fundamental problems in computer systems. The problem of mutual exclusion in a distributed system is especially interesting owing to the lack of global knowledge in the presence of variable communication delays. In this paper, a new token-based distributed mutual exclusion algorithm is...
متن کاملEvaluation of Token Based Mutual Exclusion Algorithms In Distributed Systems
This paper presents a framework for token based mutual exclusion algorithms in distributed systems. Their exists some traditional token based mutual exclusion algorithm. Some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay. In this paper, some new approaches are used, like Token ring algorithm with centralized appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 50 شماره
صفحات -
تاریخ انتشار 1994